Threshold Aggregate Query in Spatio-temporal Network Databases
نویسندگان
چکیده
Abstract. Aggregate R-B-tree (aRB-tree) provides a framework for supporting OLAP operations over spatio-temporal data. Although existing aRB-tree implementations process sptio-temporal aggregate queries pretty efficiently, it is hardly applicable for online processing due to the excessive accesses to the aggregate B-trees of the entries in the R-tree and the overlap in the R-tree. This paper addresses these problems by proposing several techniques that completely avoid the overlap in the R-tree and significantly reduce the excessive accesses to the B-trees during the update. We further extended original aRB-tree to aRBB-tree which can process the threshold aggregate queries more efficiently.
منابع مشابه
Predicted Range Aggregate Processing in Spatio-temporal Databases
Predicted range aggregate (PRA) query is an important researching issue in spatio-temporal databases. Recent studies have developed two major classes of PRA query methods: (1) accurate approaches, which search the common moving objects indexes to obtain an accurate result; and (2) estimate methods, which utilize approximate techniques to estimate the result with an acceptable error. In this pap...
متن کاملIndexing range sum queries in spatio-temporal databases
Although spatio-temporal databases have received considerable attention recently, there has been little work on processing range sum queries on the historical records of moving objects despite their importance. Since the direct access to a huge amount of data to answer range sum queries incurs prohibitive computation cost, materialization techniques based on existing index structures are sugges...
متن کاملToward a Visual Query System for Spatio-Temporal Databases
Visual query systems (VQS) for spatio-temporal databases, which enable formulation of queries involving both spatial and temporal dimensions, are an important research subject. Existing results treat these dimensions separately and there are only a few integrated proposals. This chapter presents a VQS called spatio-temporal visual query environment (S-TVQE), which allows the formulation of conv...
متن کاملQuery-By-Trace: Visual Predicate Specification in Spatio-Temporal Databases
In this paper we propose a visual interface for the specification of predicates to be used in queries on spatio-temporal databases. The approach is based on a visual specification method for temporally changing spatial situations. This extends existing concepts for visual spatial query languages, which are only capable of querying static spatial situations. We outline a preliminary user interfa...
متن کاملThe Architecture of a Flexible Querier for Spatio-Temporal Databases
In this paper, we propose a solution to the problem of designing a flexible query processor for spatio-temporal databases. Our solution is to design a bottom-up interface, whose parameters handle different spatiotemporal applications. We propose a relational schema that can cope with various spatio-temporal data types. Based on this model, we have design a flexible query processor for spatio-te...
متن کامل